The Recursive Walsh Transform

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cache conscious Walsh-Hadamard transform

The Walsh-Hadamard Transform (WHT) is an important algorithmin signal processing because of its simplicity. However, in computing large size WHT, non-unit stride access results in poor cache performance leading to severe degradation in performance. This poor cache performance is also a critical problem in achieving high performance in other large size signal transforms. In this paper, we develo...

متن کامل

Double Walsh-Hadamard Transform OFDM System

The aim of this paper is to present a novel technique to reduce the PAPR in OFDM signals. The main advantage of the proposed technique, named Double WHTOFDM reduces the SER in frequency selective channels without incrementing the error floor in non-linear channels, which happens in the conventional WHT-OFDM. Therefore, the technique proposed in this paper is a simple and efficient solution to a...

متن کامل

Characterizing and Enumerating Walsh-Hadamard Transform Algorithms

We propose a way of characterizing the algorithms computing a Walsh-Hadamard transform that consist of a sequence of arrays of butterflies (I2n−1 ⊗ DFT2) interleaved by linear permutations. Linear permutations are those that map linearly the binary representation of its element indices. We also propose a method to enumerate these algorithms.

متن کامل

Point Feature Matching Adopting Walsh Transform

This paper introduces a new method to solve the problem of matching correspondent feature points across two images containing a moving rigid object. Two successive time-varying images are used. Edge points are first extracted using a 3x3 Laplacian mask. Walsh transformation is then applied to the feature points in both images. The choice of Walsh transformation in contrast to other orthogonal t...

متن کامل

Quasi-cyclic dyadic codes in the Walsh--Hadamard transform domain

A code is -quasi-cyclic ( -QC) if there is an integer such that cyclic shift of a codeword by -positions is also a codeword. For = 1, cyclic codes are obtained. A dyadic code is a code which is closed under all dyadic shifts. An -QC dyadic ( -QCD) code is one which is both -QC and dyadic. QCD codes with = 1 give codes that are cyclic and dyadic (CD). In this correspondence, we obtain a simple c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers

سال: 1989

ISSN: 0453-4654

DOI: 10.9746/sicetr1965.25.278